The maximum clique enumeration problem: algorithms, applications, and implementations
نویسندگان
چکیده
منابع مشابه
The maximum clique problem
In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.
متن کاملThe Maximum Clique Problem
Description Given an undirected graph G = ( V, E ), a clique S is a subset of V such that for any two elements u, v ∈ S, ( u, v ) ∈ E. Using the notation ES to represent the subset of edges which have both endpoints in clique S, the induced graph GS = ( S, ES ) is complete. Finding the largest clique in a graph is an NP-hard problem, called the maximum clique problem (MCP). Cliques are intimate...
متن کاملArtificial Intelligence in the Maximum Clique Finding Problem Applications
In this paper we propose collecting different maximum clique finding algorithms into a metaalgorithm, which enables to solve this NP-hard problem much more efficiently. We provide guidelines on how this intelligent meta-algorithm can be built, what information is needed from the maximum clique finding point of view and propose an elementary structure of it. Besides we review a test environment ...
متن کاملFast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, information retrieval and many other areas related to the World Wide Web. There exist several algorithms for the problem with acceptable runtimes for certain classes of graphs, but many of them are infeasible for massive graphs. We present a new exact algorithm that employs novel pruni...
متن کاملGenetic Algorithms Based Solution To Maximum Clique Problem
Maximum Clique Problem (MCP) is an NP Complete problem which finds its application in diverse fields. The work suggests the solution of above problem with the help of Genetic Algorithms (GAs). The work also takes into consideration, the various attempts that have been made to solve this problem and other such problems. The intend is to develop a generic methodology to solve all NP Complete prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2012
ISSN: 1471-2105
DOI: 10.1186/1471-2105-13-s10-s5